Hamiltonian Adaptive Importance Sampling
نویسندگان
چکیده
Importance sampling (IS) is a powerful Monte Carlo (MC) methodology for approximating integrals, instance in the context of Bayesian inference. In IS, samples are simulated from so-called proposal distribution, and choice this key achieving high performance. adaptive IS (AIS) methods, set proposals iteratively improved. AIS relevant timely although many limitations remain yet to be overcome, e.g., curse dimensionality high-dimensional multi-modal problems. Moreover, Hamiltonian (HMC) algorithm has become increasingly popular machine learning statistics. HMC several appealing features such as its exploratory behavior, especially targets, when other methods suffer. paper, we introduce novel importance (HAIS) method. HAIS implements two-step process with parallel chains that cooperate at each iteration. The proposed efficiently adapts population proposals, extracting advantages HMC. can understood particular generic layered family an additional resampling step. achieves significant performance improvement problems w.r.t. state-of-the-art algorithms. We discuss statistical properties show two challenging examples.
منابع مشابه
Layered Adaptive Importance Sampling
Monte Carlo methods represent the de facto standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use simpler proposal probability densities for drawing candidate samples. Performance of any such method is strictly related to the specification of the proposal ...
متن کاملSafe Adaptive Importance Sampling
Importance sampling has become an indispensable strategy to speed up optimization algorithms for large-scale applications. Improved adaptive variants—using importance values defined by the complete gradient information which changes during optimization—enjoy favorable theoretical properties, but are typically computationally infeasible. In this paper we propose an efficient approximation of gra...
متن کاملAdaptive Multiple Importance Sampling
The Adaptive Multiple Importance Sampling (AMIS) algorithm is aimed at an optimal recycling of past simulations in an iterated importance sampling scheme. The difference with earlier adaptive importance sampling implementations like Population Monte Carlo is that the importance weights of all simulated values, past as well as present, are recomputed at each iteration, following the technique of...
متن کاملAdaptive Mixture Importance Sampling
Importance sampling involves approximation of functionals (such as expectations) of a target distribution by sampling from a design distribution. In many applications, it is natural or convenient to use a design distribution which is a mixture of given distributions. One typically has wide latitude in selecting the mixing probabilities of the design distribution. Furthermore, one can reduce var...
متن کاملAn Adaptive Importance Sampling Technique
This paper proposes a new adaptive importance sampling (AIS) technique for approximate evaluation of multidimensional integrals. Whereas known AIS algorithms try to find a sampling density that is approximately proportional to the integrand, our algorithm aims directly at the minimization of the variance of the sample average estimate. Our algorithm uses piecewise constant sampling densities, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2021
ISSN: ['1558-2361', '1070-9908']
DOI: https://doi.org/10.1109/lsp.2021.3068616